Secure One-Way Hash Function Using Cellular Automata for IoT

Provably Secure One-Way Hash Functions

This paper surveys recent progress on the construction of provably secure one-way hash functions, under gradually weakened assumptions. One-way hash functions have many cryptographic applications. In digital signatures, they are used to compress long input strings prior to actual signing procedures. This usually greatly improves the overall efficiency of a signature scheme. They are also used t...

Fast one-way cellular automata

Space-bounded one-way cellular language acceptors (OCA) are investigated. The only inclusion known to be strict in their time hierarchy from real-time to exponential-time is between real-time and linear-time! We show the surprising result that there exists an infinite hierarchy of properly included OCA-language families in that range. A generalization of a method in [9] is shown which provides ...

VLSI Architecture of a Cellular Automata based One-Way Function

In this paper, a technique to generate expander graphs using Cellular Automata (CA) has been presented. The special class of CA, known as the Two Predecessor Single Attractor Cellular Automata (TPSA CA) has been characterized. It has been shown that the expander graphs built using the TPSA-CA are promising and lead to the development of strong one-way functions. The paper proposes an efficient ...

Cellular Automata Based Cryptographic Hash Function

* This research was supported by Basic Science Research Program through the National Research Foundation of Korea(NRF) funded by the Ministry of Education, Science and Technology(2011-0014977). Abstract Recently, in many applications where speed is important and very large amounts of data have to be authenticated, hardware implementation is demanded as a natural solution. A cellular automata (C...

Complexity of One-Way Cellular Automata